Extended DBP for (m, k)-Firm Based QoS
نویسندگان
چکیده
In this paper, an extended DBP (E DBP) scheme is studied for (m,k)-firm constraint. The basic idea of the proposed algorithm takes into account the distance to exit a failure state, which is a symmetrical notion of distance to fall into a failure state in DBP. Quality of Service (QoS) in terms of dynamic failure and delay is evaluated. Simulation results reveal the effectiveness of E DBP to provide better QoS.
منابع مشابه
An integrated DBP for streams with (m, k)-firm real-time guarantee.
(m, k)-firm real-time or weakly hard real-time (WHRT) guarantee is becoming attractive as it closes the gap between hard and soft (or probabilistic) real-time guarantee, and enables finer granularity of real-time QoS through adjusting m and k. For multiple streams with (m, k)-firm constraint sharing a single server, an on-line priority assignment policy based on the most recent k-length history...
متن کاملProviding Real-Time Applications With Graceful Degradation of QoS and Fault Tolerance According to(m, k)-Firm Model
(m,k)-firm model has recently drawn a lot of attention. It provides a flexible real-time system with graceful degradation of the QoS, thus achieving the fault tolerance in case of system overload. In this paper we first give a review of the existing work on the use of the (m,k)-firm model for handling the QoS and fault tolerance management. Then we focus on DBP algorithm as it presents the inte...
متن کاملExtension of ReInForM Protocol for (m, k)-firm Real-time Streams in Wireless Sensor Networks
For real-time wireless sensor network applications, it is essential to provide different levels of quality of service (QoS) such as reliability, low latency, and fault-tolerant traffic control. To meet these requirements, an (m,k)-firm based real-time routing protocol has been proposed in our prior work, including a novel local transmission status indicator called local DBP (L_DBP). In this pap...
متن کاملMatrix-DBP For (m, k)-firm Real-Time Guarantee
1 (m, k)-firm means at least m deadlines should be met among any k consecutive task invocations or message transmissions. Providing (m, k)-firm guarantee is becoming attractive as it proposes an alternative between hard real-time guarantee (case of m = k) and soft (or probabilistic) real-time guarantee with p = m/k (when m, k → ∞) and allows more effective utilization of server resources (proce...
متن کامل(m,k)-firm constraints and DBP: counter-intuitive phenomena and exact feasibility test
In this paper we study the scheduling of (m, k )–firm synchronous periodic task systems using the Distance Based Priority (DBP) scheduler. We first show three (counter-intuitive) phenomena: (i) choosing, for each task, the initial k -sequence 1k is not optimal, (ii) even less intuitive, but not contradictory, we can even start the scheduling from a (fictive) error state (in regard to the initia...
متن کامل